Context Matters: Adaptive Mutation for Grammars
نویسندگان
چکیده
This work proposes Adaptive Facilitated Mutation, a self-adaptive mutation method for Structured Grammatical Evolution (SGE), biologically inspired by the theory of facilitated variation. In SGE, genotype individuals contains list each non-terminal grammar that defines search space. our proposed mutation, individual an array with different, rate non-terminal. We also propose Function Grouped Grammars, design procedure, to enhance benefits mutation. Experiments were conducted on three symbolic regression benchmarks using Probabilistic (PSGE), variant SGE. Results show approach is similar or better when compared standard and
منابع مشابه
Context Matters
Midbrain dopamine neurons are thought to encode the difference between predicted and actual reward on conditioning tasks. Successful models assumed a simple form of prediction that depended only on currently available information. In this issue of Neuron, Nakahara and colleagues record from dopamine neurons in alert monkeys and show that the neurons can encode predictions that are not so restri...
متن کاملDependency Grammars and Context-Free Grammars
The question arises from time to time what the relation is between dependency grammars (DG’s) and phrase-structure grammars. A classic paper by Gaifman [1] would appear to have laid the issue to rest, by proving that dependency grammars are a special case of context-free grammars (CFG’s). Gaifman proves that dependency grammars are equivalent to a proper subset of phrasestructure grammars, thos...
متن کاملPregroup Grammars and Context-free Grammars
Pregroup grammars were introduced by Lambek [20] as a new formalism of type-logical grammars. They are weakly equivalent to context-free grammars [8]. The proof in one direction uses the fact that context-free languages are closed under homomorphism and inverse homomorphism. Here we present a direct construction of a context-free grammar and a push-down automaton, equivalent to a given pregroup...
متن کاملModularized Context-Free Grammars
Given two context-free grammars (CFGs), G 1 and G 2 , the language generated by the union of the grammars is not the union of the languages generated by each grammar: L(G 1 G 2) 6 = L(G 1) L(G 2). In order to account for mod-ularity of grammars, another way of deening the meaning of grammars is needed. This paper adapts results from the semantics of logic programming languages to CFGs. We discu...
متن کاملMultiple Context-Free Grammars
Multiple context-free grammar (MCFG) is a weakly contextsensitive grammar formalism that deals with tuples of strings. An MCFG is called m-MCFG if all tuples have at most m components. In this summary I will outline that the expressivity of m-MCFG’s increases with the parameter m and that the class of tree-adjoining languages is properly included in the class of 2-multiple context-free language...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2023
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-031-29573-7_8